361 research outputs found
Robust Connectivity Analysis for Multi-Agent Systems
In this report we provide a decentralized robust control approach, which
guarantees that connectivity of a multi-agent network is maintained when
certain bounded input terms are added to the control strategy. Our main
motivation for this framework is to determine abstractions for multi-agent
systems under coupled constraints which are further exploited for high level
plan generation.Comment: 20 page
Decentralized Abstractions for Feedback Interconnected Multi-Agent Systems
The purpose of this report is to define abstractions for multi-agent systems
under coupled constraints. In the proposed decentralized framework, we specify
a finite or countable transition system for each agent which only takes into
account the discrete positions of its neighbors. The dynamics of the considered
systems consist of two components. An appropriate feedback law which guarantees
that certain performance requirements (eg. connectivity) are preserved and
induces the coupled constraints and additional free inputs which we exploit in
order to accomplish high level tasks. In this work we provide sufficient
conditions on the space and time discretization of the system which ensure that
we can extract a well posed and hence meaningful finite transition system.Comment: 15 page
Prescribed Performance Control Guided Policy Improvement for Satisfying Signal Temporal Logic Tasks
Signal temporal logic (STL) provides a user-friendly interface for defining
complex tasks for robotic systems. Recent efforts aim at designing control laws
or using reinforcement learning methods to find policies which guarantee
satisfaction of these tasks. While the former suffer from the trade-off between
task specification and computational complexity, the latter encounter
difficulties in exploration as the tasks become more complex and challenging to
satisfy. This paper proposes to combine the benefits of the two approaches and
use an efficient prescribed performance control (PPC) base law to guide
exploration within the reinforcement learning algorithm. The potential of the
method is demonstrated in a simulated environment through two sample
navigational tasks.Comment: This is the extended version of the paper accepted to the 2019
American Control Conference (ACC), Philadelphia (to be published
Online Abstractions for Interconnected Multi-Agent Control Systems
In this report, we aim at the development of an online abstraction framework
for multi-agent systems under coupled constraints. The motion capabilities of
each agent are abstracted through a finite state transition system in order to
capture reachability properties of the coupled multi-agent system over a finite
time horizon in a decentralized manner. In the first part of this work, we
define online abstractions by discretizing an overapproximation of the agents'
reachable sets over the horizon. Then, sufficient conditions relating the
discretization and the agent's dynamics properties are provided, in order to
quantify the transition possibilities of each agent.Comment: 22 pages. arXiv admin note: text overlap with arXiv:1603.0478
Consensus Control for Leader-follower Multi-agent Systems under Prescribed Performance Guarantees
This paper addresses the problem of distributed control for leader-follower
multi-agent systems under prescribed performance guarantees. Leader-follower is
meant in the sense that a group of agents with external inputs are selected as
leaders in order to drive the group of followers in a way that the entire
system can achieve consensus within certain prescribed performance transient
bounds. Under the assumption of tree graphs, a distributed control law is
proposed when the decay rate of the performance functions is within a
sufficient bound. Then, two classes of tree graphs that can have additional
followers are investigated. Finally, several simulation examples are given to
illustrate the results.Comment: 8 page
- …